A New Peer-to-Peer Network Constitution Based on DHT

doi:10.13190/jbupt.200701.118.hanl

JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM ›› 2007, Vol. 30 ›› Issue (1): 118-122.doi: 10.13190/jbupt.200701.118.hanl

• Reports • Previous Articles Next Articles

A New Peer-to-Peer Network Constitution Based on DHT

HAN Li, LEI Zhen-ming, LIU Fang

School of Information Engineering , Beijing University of Posts and Telecommunications, Beijing 100876, China

Received:2006-10-10 Revised:1900-01-01 Online:2007-03-30 Published:2007-03-30
Contact: HAN Li

Abstract

Abstract:

A constant-degree peer-to-peer network constitution based on d dimension star connected cycles(SCC) graph was presented firstly, namely SCC- distributed Hash table (DHT). It adopts DHT to search and locate resource, and the connection of network nodes are covered and connected according to SCC graph. SCC-DHT achieves a time complexity of logic hop per lookup request by using neighbors per node. The simulation results show that SCC-DHT has better robustness and expansibility.

Key words: peer-to-peer network, distribute Hash table, star connected cycles graph, small constant-degree

CLC Number:

TN911.22

HAN Li, LEI Zhen-ming, LIU Fang. A New Peer-to-Peer Network Constitution Based on DHT[J]. JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM, 2007, 30(1): 118-122.

References

[1] Clark D. Face-to-face with peer-to-peer networking [J]. IEEE Computer, 2001, 34(1): 18-21.
[2] Schoder D, Fischbach K. Peer-to-peer prospects [J]. Communications of the ACM, 2003, 46(2): 27-29.
[3] Tomoya K, Shigeki Y. Application of P2P technology to marketing // Proceedings of the 2003 International Conference on Cyberworlds. Washington:IEEE Computer Society Press, 2003: 372-379.
[4] Lichun Ji, Deters R. Coordination and enterprise wide P2P computing //Proceedings of 2005 IEEE International Conference on Service Computing. Washington: IEEE Computer Society press, 2005: 141-148.
[5] Balakrishnan H, Kaashoek M F. Looking up data in P2P systems [J]. Communications of the ACM, 2003, 46(2): 43-48.
[6] Ratnasamy S, Shenker S, Stoica I. Routing algorithms for DHTs: some open questions //Proceedings of 1^st Workshop on Peer-to-Peer Systems. Cambridge: , 2002: 45-52.
[7] Saroiu S, Gummadi P K, Gribble S D. A measurement study of peer-to-peer Sharing Systems //Proceedings of Multimedia Computing and Networking 2002(MMCN). San Jose: , 2002: 156-170.
[8] Stoica I, Morris R, Karger D. Chord: a scalable peer-to-peer lookup service for internet applications // Proceedings of ACM SIGCOMM 2001. San Deigo CA: , 2001: 149-160.
[9] Rowstron A, Druschel P. Pastry: scalable, distributed object location and routing for large-scale peer-to-peer systems //IFIP/ACM International Conference on Distirbuted Systems Platforms (Middleware). HeideIberg:, 2001: 329-350.
[10] Zhao Y B, Huang L, Stribling J, et al. Tapestry: a resilient global-scale overlay for service deployment [J]. IEEE Journal on Selected Areas in Communications, 2004, 22(1): 41-53.
[11] Ratansamy S, Francis P, Handley M, et al. A scalable content-addressable network //Proceedings of ACM SIGCOMM 2001. San Deigo: , 2001: 161-172.
[12] Maymounkov P, Mazzieres D. Kademlia: a peer-to-peer information system based on the XOR metric //Proceedings of 1^st International Workshop on Peer-to-Peer System IPTPS 2002. Cambridge: , 2002: 53-65.
[13] Kaashoek F, Karger D R. Koorde: a simple degree-optimal hash table //Proceedings of 2^nd workshop on Peer-to-Peer systems. Berkeley: , 2003: 98-107.
[14] Fraigniaud P, Gattron P. The content-addressable network D2B . : CNRS University de Paris-sud France, 2003.
[15] Loguinov D, Kumar A. Graph-theoretic analysis of structured peer-to-peer systems: routing distances and fault resilence //Proceedings of ACM SIGCOMM 2003. Germany: , 2003: 395-406.
[16] Malkhi D, Naor M, Ratajczak D. Viceroy: a scalable and dynamic lookup network //Proceedings of 21^st ACM Symp on Principles of Distributed Computing. Monterey: , 2002: 367-389.
[17] Xu J, Kumar A, Yu X X. On the fundamental tradeoffs between routing table size and network diameter in peer-to-peer networks [J]. IEEE Jounal on Selected Areas on Communications, 2004, 22(1): 151-163.
[18] Li Dongsheng, Lu Xicheng, Wu Jie. FISSIONE: a scalable constant degree and low congestion DHT schemes based on Kautz graphs //Proceedings of INFOCOM 2005. 24^th Annual Joint Conference of the IEEE Computer and Communications Societies, 2005: 1677-1688.
[19] Latifi S, Azevedo M, Bagherzadeh N. the star connected cycles: a fix-degree network for parallel processing //Proceedings of International Conference on Parallel Processing. 1993: 100-110.
[20] Sheldon B A, Dov H, Balakrishnan K. The star graph: an attractive alternative to the n-cube //Proceedings of Parallel Processing. New York :, 1987: 393-400.

A New Peer-to-Peer Network Constitution Based on DHT

PDF

Knowledge

Abstract

Cite this article

share this article

References

Related Articles 6

Recommended Articles

Metrics

Comments

[1]	ZHANG Chun-hong, HU Qing-yuan, CHENG Shi-duan. A Distributed Semantic Resources Search Based on Dimensionality Reduction Algorithm [J]. JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM, 2013, 36(2): 74-78.
[2]	. Measurement of the Characteristics of the BitTorrent Network [J]. JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM, 2012, 35(3): 125-128.
[3]	LU Feng；ZHENG Kang-feng；NIU Xin-xin；YANG Yi-xian. Construct a Risk-Aware Peer-to-Peer Security Trust Model [J]. JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM, 2010, 33(1): 33-37.
[4]	GONG Yan1,2,YANG Fang-chun1,ZOU Hua1,SHUANG Kai1. A Resource Discovery Approach Based on the Trust and Social Networks [J]. JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM, 2009, 32(5): 84-87.
[5]	GUAN Zhi-tao1, 2, CAO Yuan-da2, LI Jian3. Incentive-Based Search Algorithm in Hybrid Peer-to-Peer Networks [J]. JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM, 2008, 31(2): 42-45.
[6]	GAO Chang-xi, ZHANG Fu-yuan, XIN Yang, NIU Xin-xin, YANG Yi-xian . Research on Worm’s Propagation and Defense Model in Different P2P Networks [J]. JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM, 2006, 29(s2): 49-53.